Restrictions on Concept Lattices for Pattern Management
نویسندگان
چکیده
This paper addresses the problem of pattern management in the framework of formal concept analysis using restrictions on objects or attributes of a given data set. Patterns are pieces of information/knowledge with a concise description that can be obtained from data using data mining techniques. These can be clusters or bi-clusters, implications or association rules, and so on. Even for relatively small data collections, the set of discovered patterns could be very large and therefore difficult to handle. In this paper we propose efficient methods to conduct the projection of a concept lattice on a set of attributes. The selection of a concept lattice on a set of objects is done dually.
منابع مشابه
Algebraic operators for querying pattern bases
The objectives of this research work which is intimately related to pattern discovery and management are threefold: (i) handle the problem of pattern manipulation by defining operations on patterns, (ii) study the problem of enriching and updating a pattern set (e.g., concepts, rules) when changes occur in the user’s needs and the input data (e.g., object/attribute insertion or elimination, tax...
متن کاملOn generalized topological molecular lattices
In this paper, we introduce the concept of the generalized topological molecular lattices as a generalization of Wang's topological molecular lattices, topological spaces, fuzzy topological spaces, L-fuzzy topological spaces and soft topological spaces. Topological molecular lattices were defined by closed elements, but in this new structure we present the concept of the open elements and defi...
متن کاملMorphisms Between Pattern Structures and Their Impact on Concept Lattices
We provide a general framework for pattern structures by investigating adjunctions between posets and their morphisms. Our special interest is the impact of pattern morphisms on the induced concept lattices. In particular we are interested in conditions which are sufficient for the induced residuated maps to be injective, surjective or bijective. One application is that every representation con...
متن کاملMining Non- Redundant Frequent Pattern in Taxonomy Datasets using Concept Lattices
In general frequent itemsets are generated from large data sets by applying various association rule mining algorithms, these produce many redundant frequent itemsets. In this paper we proposed a new framework for Non-redundant frequent itemset generation using closed frequent itemsets without lose of information on Taxonomy Datasets using concept lattices. General Terms Frequent Pattern, Assoc...
متن کاملSymbolic Galois Lattices with Pattern Structures
Concept lattices are mathematical structures useful for many tasks in knowledge discovery and management. A concept lattice is basically obtained from binary data encoding the membership of some attributes to some objects. Dealing with complex data brings the important problem of discretization and the associated loss of information. To avoid discretization, (i) pattern structures and (ii) symb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010